Adhesive Categories
نویسندگان
چکیده
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.
منابع مشابه
Algebraic High-Level Nets as Weak Adhesive HLR Categories
Adhesive high-level replacement (HLR) system have been recently introduced as a new categorical framework for graph transformation in the double pushout approach [1, 2]. They combine the well-known framework of HLR systems with the framework of adhesive categories introduced by Lack and Sobociński [3, 4]. The main concept behind adhesive categories are the so-called van Kampen squares, which en...
متن کاملCategorical Frameworks for Graph Transformation and HLR Systems Based on the DPO Approach
Several variants of high-level replacement (HLR) and adhesive categories have been introduced in the literature as categorical frameworks for graph transformation and HLR systems based on the double pushout (DPO) approach. In addition to HLR, adhesive, and adhesive HLR categories several weak variants, especially weak adhesive HLR with horizontal and vertical variants, as well as partial varian...
متن کاملAdhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well t...
متن کاملWeak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
Adhesive high-level replacement (HLR) systems have been recently introduced as a new categorical framework for graph tranformation in the double pushout (DPO) approach. They combine the wellknown concept of HLR systems with the concept of adhesive categories introduced by Lack and Sobociński. While graphs, typed graphs, attributed graphs and several other variants of graphs together with corres...
متن کاملToposes Are Adhesive
Adhesive categories have recently been proposed as a categorical foundation for facets of the theory of graph transformation, and have also been used to study techniques from process algebra for reasoning about concurrency. Here we continue our study of adhesive categories by showing that toposes are adhesive. The proof relies on exploiting the relationship between adhesive categories, Brown an...
متن کامل